Optimal Decremental Connectivity in Planar Graphs
نویسندگان
چکیده
منابع مشابه
Optimal On-Line Decremental Connectivity in Trees
Let T be a tree with n nodes from which edges are deleted interspersed with m on-line connectivity queries. Even and Shiloach gave an O(n log n + m) algorithm to process edge deletion and m queries (An On-Line Edge-Deletion problem, J. ACM, Vol. 28, Nr. 1, 1981). In this paper we present an O(n + m) algorithm for the same problem.
متن کاملConnectivity of Planar Graphs
We give here three simple linear time algorithms on planar graphs: a 4-connexity test for maximal planar graphs, an algorithm enumerating the triangles and a 3-connexity test. Although all these problems got already linear-time solutions, the presented algorithms are both simple and efficient. They are based on some new theoretical results. Communicated by T. Nishizeki, R. Tamassia and D. Wagne...
متن کاملDecremental Data Structures for Connectivity and Dominators in Directed Graphs
We introduce a new dynamic data structure for maintaining the strongly connected components (SCCs) of a directed graph (digraph) under edge deletions, so as to answer a rich repertoire of connectivity queries. Our main technical contribution is a decremental data structure that supports sensitivity queries of the form “are u and v strongly connected in the graph G \ w?”, for any triple of verti...
متن کاملConnectivity Oracles for Planar Graphs
We consider dynamic subgraph connectivity problems for planar undirected graphs. In this model there is a fixed underlying planar graph, where each edge and vertex is either “off” (failed) or “on” (recovered). We wish to answer connectivity queries with respect to the “on” subgraph. The model has two natural variants, one in which there are d edge/vertex failures that precede all connectivity q...
متن کاملConnectivity augmentation in planar straight line graphs∗
It is shown that every connected planar straight line graph with n ≥ 3 vertices has an embedding preserving augmentation to a 2-edge connected planar straight line graph with at most b(2n − 2)/3c new edges. It is also shown that every planar straight line tree with n ≥ 3 vertices has an embedding preserving augmentation to a 2-edge connected planar topological graph with at most bn/2c new edges...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2016
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-016-9709-x